/*
 * @(#)AStarNode.java     14/08/02
 * 
 * Author             Rick Wilson
 * Copyright (c) 2014 Rick Wilson
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *     * Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in the
 *       documentation and/or other materials provided with the distribution.
 *     * Neither the name of 'Taareekah' nor the
 *       names of its contributors may be used to endorse or promote products
 *       derived from this software without specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 */



package util;

/**
 *
 * @author rick
 */
class AStarNode extends Point {

    /** Field description */
    private double	distance_from_start, estimated_distance_to_goal;

    /** Field description */
    private AStarNode	previous;

    /**
     * Constructs ...
     *
     *
     * @param x
     * @param y
     */
    public AStarNode(int x, int y) {
	this.x	= x;
	this.y	= y;
    }

    /*
     *       public Vector<AStarNode> getNeighborsWithinRange(int min_inclusive, int max_exclusive) {
     *
     *   Point neighbors[] = getNeighbors();
     *   Vector<AStarNode> ret = new Vector<AStarNode>();
     *   for (int i = 0; i < 8; i++) {
     *       if(neighbors[i].withinRange(min_inclusive, max_exclusive)) {
     *           ret.add(new AStarNode(neighbors[i].getX(), neighbors[i].getY()));
     *       }
     *   }
     *
     *   return ret;
     * }
     */

    /**
     * Method description
     *
     *
     * @param dist
     */
    public void setDistanceFromStart(double dist) {
	distance_from_start	= dist;
    }

    /**
     * Method description
     *
     *
     * @return
     */
    public double getDistanceFromStart() {
	return distance_from_start;
    }

    /**
     * Method description
     *
     *
     * @param dist
     */
    public void setEstimatedDistanceToGoal(double dist) {
	estimated_distance_to_goal	= dist;
    }

    /**
     * Method description
     *
     *
     * @return
     */
    public AStarNode getPrevious() {
	return previous;
    }

    /**
     * Method description
     *
     *
     * @param p
     */
    public void setPrevious(AStarNode p) {
	previous	= p;
    }
}


//~ Formatted by Jindent --- http://www.jindent.com
